package binarySearch;

//https://leetcode.cn/problems/find-peak-element/description/
public class l_162 {
    public int findPeakElement(int[] nums) {
        int left = 0, right = nums.length - 1;

        //根据if条件两种二分查找做法都可以
        while(left < right) {
            int mid = left + (right - left + 1) / 2;
            if(nums[mid] > nums[mid - 1]) left = mid;
            else right = mid - 1;
        }
        return left;
    }
}
